Performance Analysis of Multi-Objective Simulated Annealing Based on Decomposition

نویسندگان

چکیده

Simulated annealing is a metaheuristic that balances exploration and exploitation to solve global optimization problems. However, deal with multi- many-objective problems, this balance needs be improved due diverse factors such as the number of objectives. To issue, work proposes MOSA/D, hybrid framework for multi-objective simulated based on decomposition evolutionary perturbation functions. According literature, strategy allows diversity in population while perturbations add convergence toward Pareto front; however, question should asked: What effect components when included part design? Hence, studies performance MOSA/D considering its implementation two widely used operators: classical genetic operators differential evolution. The proposed algorithms are MOSA/D-CGO, operators, MOSA/D-DE, evolution operators. main contribution analysis using both identifying one most suitable framework. approaches were tested DTLZ three objectives CEC2009 benchmarks two, three, five, ten objectives; considered measured through hypervolume (HV) inverted generational distance (IGD) indicators. results pointed out there promising improvement favor MOSA/D-DE.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Adaptive Evolutionary Multi-Objective Approach Based on Simulated Annealing

A multi-objective optimization problem can be solved by decomposing it into one or more single objective subproblems in some multi-objective metaheuristic algorithms. Each subproblem corresponds to one weighted aggregation function. For example, MOEA/D is an evolutionary multi-objective optimization (EMO) algorithm that attempts to optimize multiple subproblems simultaneously by evolving a popu...

متن کامل

Numeric Multi-Objective Rule Mining Using Simulated Annealing Algorithm

Abstract as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the da...

متن کامل

Multi-Case Multi-Objective Simulated Annealing (MC-MOSA): New Approach to Adapt Simulated Annealing to Multi-objective Optimization

In this paper a new approach is proposed for the adaptation of the simulated annealing search in the field of the Multi-Objective Optimization (MOO). This new approach is called Multi-Case Multi-Objective Simulated Annealing (MC-MOSA). It uses some basics of a well-known recent Multi-Objective Simulated Annealing proposed by Ulungu et al., which is referred in the literature as U-MOSA. However,...

متن کامل

Multi-constrained routing based on simulated annealing

Multi-constrained quality-of-service routing (QoSR) is to find a feasible path that satisfies multiple constraints simultaneously, as an NPC problem, which is also a big challenge for the upcoming next-generation networks. In this paper, we propose SA_MCP, a novel heuristic algorithm, by applying simulated annealing to Dijkstra's algorithm. This algorithm first uses a nonlinear energy function ...

متن کامل

A Study of Simulated Annealing Techniques for Multi-Objective Optimisation

Many areas in which computational optimisation may be applied are multi-objective optimisation problems; those where multiple objectives must be minimised (for minimisation problems) or maximised (for maximisation problems). Where (as is usually the case) these are competing objectives, the optimisation involves the discovery of a set of solutions the quality of which cannot be distinguished wi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical and computational applications

سال: 2023

ISSN: ['1300-686X', '2297-8747']

DOI: https://doi.org/10.3390/mca28020038